Automatically Populating Acception Lexical Database through Bilingual Dictionaries and Conceptual Vectors
نویسنده
چکیده
The NLP team of LIRMM currently works on thematic and lexical disambiguation text analysis [Lafourcade, 2001]. We built a system, with automated learning capabilities, based on conceptual vectors for meaning representation. Vectors are supposed to encode ideas associated to words or expressions. In the framework of Acception Based Lexical Database (instantiated through the Papillon project), we devise some conceptual vector based strategies to automatically populate and check acceptions. In this context, an acception represents a meaning of an entry of a monolingual dictionary, and could be refined and associated to a conceptual vector. Vectors are used for decision making and link quality assessment.
منابع مشابه
Hardening of Acception Links Through Vectorized Lexical Functions
In the framework of the Papillon project, we have defined strategies for populating a pivot dictionnary of interlingual links from monolingual vectorial bases. There are quite a number of acception per entry thus, the proper identification may be quite troublesome and some added clues beside acception links may be usefull. We improve the integrity of the acception base through welsl known seman...
متن کاملOn multiword lexical units and their role in maritime dictionaries
Multi-word lexical units are a typical feature of specialized dictionaries, in particular monolingual and bilingual maritime dictionaries. The paper studies the concept of the multi-word lexical unit and considers the similarities and differences of their selection and presentation in monolingual and bilingual maritime dictionaries. The work analyses such issues as the classification of multi-w...
متن کاملAnt Algorithms, Conceptual Vectors and Fuzzy Unl Graphs
In the context on the UNL project, we focus on the automatization of enconversion process, that is the building of UNL graphs from sentences. We present an extension of the UNL graph structure aiming at handling lexical and relational ambiguities. On this intermediate structure, we can apply ant algorithm propagation of conceptual vectors and other constraints. Graph nodes and relations have a ...
متن کاملFrom word sense naming to vocabulary augmentation in Papillon
In the framework of the Papillon project, there are acceptions that are not lexicalized in a given language. They correspond at best to some hypernyms. Moreover, in order to easily supervise a translation process, we would like to be able to name meanings instead of referring to definitions by numbers. Dictionaries define words using a ”genus + differentia” approach and can be exploited for new...
متن کاملSemantic Analysis through Ant Algorithms, Conceptual Vectors and Fuzzy UNL Graphs
In the context on the UNL project, we focus on the automatization of enconversion process, that is the building of UNL graphs from sentences. We present an extension of the UNL graph structure aiming at handling lexical and relational ambiguities. On this intermediate structure, we can apply ant algorithm propagation of conceptual vectors and other constraints. Graph nodes and relations have a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002